Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("KASAMI T")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 49

  • Page / 2
Export

Selection :

  • and

SOME UNDECIDABLE PROBLEMS FOR PETRI NETS.ARAKI T; KASAMI T.1976; SYST. COMPUTER CONTROLS; U.S.A.; DA. 1976 PARU 1977; VOL. 7; NO 1; PP. 20-28; BIBL. 14 REF.Article

SOME PROGRAM SCHEMAS OPERATING ON TREE DATA STRUCTURES.TOKURA N; KASAMI T.1974; SYST. COMPUTERS CONTROLS; U.S.A.; DA. 1974; PP. 81-89; BIBL. 11 REF.Article

DEADLOCK DETECTION AND RECOVERY IN DISTRIBUTED SYSTEMSSUGIYAMA Y; KASAMI T.1980; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1980; VOL. 11; NO 1; PP. 18-26; BIBL. 3 REF.Article

SOME DECISION PROBLEMS RELATED TO THE REACHABILITY PROBLEM FOR PETRI NETS.ARAKI T; KASAMI T.1976; THEOR. COMPUTER SCI.; NETH.; DA. 1976 PARU 1977; VOL. 3; NO 1; PP. 85-104; BIBL. 14 REF.Article

SOME RESULTS ON THE MINIMUM WEIGHT OF PRIMITIVE BCH CODESKASAMI T; LIN S.1972; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1972; VOL. 18; NO 6; PP. 824-825; BIBL. 6 REF.Serial Issue

AN 0(N) ALGORITHM FOR COMPUTING THE SET OF AVAILABLE EXPRESSIONS OF D-CHARTS.TANIGUCHI K; KASAMI T.1976; ACTA INFORMAT.; ALLEM.; DA. 1976; VOL. 6; NO 4; PP. 361-364; BIBL. 10 REF.Article

BOUNDS ON THE ACHIEVABLE RATES OF BLOCK CODING FOR A MEMORY LESS MULTIPLE-ACCESS CHANNELKASAMI T; LIN S.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 2; PP. 187-197; BIBL. 14 REF.Article

LINEAR BLOCK CODES FOR ERROR DETECTIONKASAMI T; KLOEVE T; SHULIN et al.1983; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1983; VOL. 29; NO 1; PP. 131-136; BIBL. 10 REF.Article

ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA.TANIGUCHI K; KASAMI T; SUGIYAMA Y et al.1975; SYST. COMPUTERS CONTROLS; U.S.A.; DA. 1975; VOL. 6; NO 1; PP. 36-44; BIBL. 10 REF.Article

EXISTENCE OF GOOD DELTA -DECODABLE CODES FOR THE TWO-USER MULTIPLE-ACCESS ADDER CHANNELSHU LIN; KASAMI T; YAMAMURA S et al.1980; IBM J. RES. DEVELOP.; ISSN 0018-8646; USA; DA. 1980; VOL. 24; NO 4; PP. 486-495; BIBL. 12 REF.Article

PUISSANCE DES CODES ADDITIFS CONCORDANTS CORRECTEURS D'ERREURS ET DE DEFAUTSKASAMI T; YAMAMURA S; KUZNETSOV AV et al.1978; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1978; VOL. 14; NO 2; PP. 3-10; BIBL. 8 REF.Article

AN ERROR CORRECTING SCHEME FOR DEFECTIVE MEMORYKUZNETSOV AV; KASAMI T; YAMAMURA S et al.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 6; PP. 712-718; BIBL. 12 REF.Article

ON THE WEIGHT ENUMERATION OF WEIGHTS LESS THAN 2.5 D OF REED-MULLER CODES.KASAMI T; TOKURA N; AZUMI S et al.1976; INFORM. AND CONTROL; U.S.A.; DA. 1976; VOL. 30; NO 4; PP. 380-395; BIBL. 18 REF.Article

INFERENCE OF EMBEDDED MULTIVALUED DEPENDENCIES IN RELATIONAL DATABASESITO M; TANIGUCHI K; KASAMI T et al.1980; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1980 PUBL. 1982; VOL. 11; NO 5; PP. 1-8; BIBL. 10 REF.Article

DECISION PROBLEMS FOR MULTIVALUED DEPENDENCIES IN RELATIONAL DATABASESHAGIHARA K; ITO M; TANIGUCHI K et al.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 2; PP. 247-264; BIBL. 10 REF.Article

ANALGEBRAIC SPECIFICATION OF HDLC PROCEDURESMORI M; HIGASHIMO T; SUGIYAMA Y et al.1981; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1981 PUBL. 1982; VOL. 12; NO 1; PP. 64-74; BIBL. 8 REF.Article

MEMBERSHIP PROBLEM FOR MULTIVALUED DEPENDENCIES IN RELATIONAL DATABASESHAGIHARA K; ITO M; TANIGUCHI K et al.1978; SYST., COMPUT., CONTROLS; ISSN 0096-8765; USA; DA. 1978 PUBL. 1980; VOL. 9; NO 6; PP. 62-70; BIBL. 10 REF.Article

On the possibility of undetected error for the maximum distance separable codesKASAMI, T; SHU LIN.IEEE transactions on communications. 1984, Vol 32, Num 9, pp 998-1006, issn 0090-6778Article

Three measures for synchronic dependence in Petri netsSUZUKI, I; KASAMI, T.Acta informatica. 1983, Vol 19, Num 4, pp 325-338, issn 0001-5903Article

COMPLEXITY OF THE DEADLOCK AVOIDANCE PROBLEMSUGIYAMA Y; ARAKI T; KASAMI T et al.1977; SYST. COMPUTERS CONTROLS; USA; DA. 1977; VOL. 8; NO 2; PP. 44-51; BIBL. 5 REF.Article

Error performance of multi-stage hard-decision bounded distance decoding for multi-level block modulation codesKATAOKA, M; TAKATA, T; KASAMI, T et al.IEICE transactions. 1991, Vol 74, Num 9, pp 2555-2562, issn 0917-1673Article

An error control system with multiple-stage forward error correctionsTAKATA, T; FUJIWARA, T; KASAMI, T et al.IEEE transactions on communications. 1990, Vol 38, Num 10, pp 1799-1809, issn 0090-6778Article

Functional programming for the telegram analysis problemSUGIYAMA, Y; TORII, K; KASAMI, T et al.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1988, Vol 71, Num 5, pp 523-529, issn 0387-236XArticle

A cascaded coding scheme for error control and its performance analysisKASAMI, T; FUJIWARA, T; TAKATA, T et al.IEEE transactions on information theory. 1988, Vol 34, Num 3, pp 448-462, issn 0018-9448Article

On the undetected error probability for shortened Hamming codesFUJIWARA, T; KASAMI, T; KITAI, A et al.IEEE transactions on communications. 1985, Vol 33, Num 6, pp 570-574, issn 0090-6778Article

  • Page / 2